Voting as Validation in Robot Programming

نویسندگان

  • Simukai W. Utete
  • Billur Barshan
  • Birsel Ayrulu
چکیده

This paper investigates the use of voting as a conflict-resolution technique for data analysis in robot programming. Voting represents an information-abstraction technique. It is argued that in some cases a voting approach is inherent in the nature of the data being analyzed: where multiple, independent sources of information must be reconciled to give a group decision that reflects a single outcome rather than a consensus average. This study considers an example of target classification using sonar sensors. Physical models of reflections from target primitives that are typical of the indoor environment of a mobile robot are used. Dispersed sensors take decisions on target type, which must then be fused to give the single group classification of the presence or absence and type of a target. Dempster-Shafer evidential reasoning is used to assign a level of belief to each sensor decision. The decisions are then fused by two means. Using Dempster’s rule of combination, conflicts are resolved through a group measure expressing dissonance in the sensor views. This evidential approach is contrasted with the resolution of sensor conflict through voting. It is demonstrated that abstraction of the level of belief through voting proves useful in resolving the straightforward conflicts that arise in the classification problem. Conflicts arise where the discriminant data value, an echo amplitude, is most sensitive to noise. Fusion helps to overcome this vulnerability: in Dempster-Shafer reasoning, through the modeling of nonparametric uncertainty and combination of belief values; and in voting, by emphasizing the majority view. The paper gives theoretical and experimental evidence for the use of voting for data abstraction and conflict resolution in areas such as classification, where a strong argument can be made for techniques that emphasize a single outcome rather than an estimated value. Methods for making the vote more strategic are also investigated. The paper addresses the reduction of dimension of sets of decision points or decision makers. Through a consideration of combination order, queuing criteria for more strategic fusion are identified. The International Journal of Robotics Research Vol. 18, No. 4, April 1999, pp. 401-413, ©1999 Sage Publications, Inc. KEY WORDS—voting, Dempster-Shafer theory, evidential reasoning, sonar sensing, ultrasonic transducers, multisensor data fusion, spatial placement, robot programming, target classification, learning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of ensemble learning techniques to model the atmospheric concentration of SO2

In view of pollution prediction modeling, the study adopts homogenous (random forest, bagging, and additive regression) and heterogeneous (voting) ensemble classifiers to predict the atmospheric concentration of Sulphur dioxide. For model validation, results were compared against widely known single base classifiers such as support vector machine, multilayer perceptron, linear regression and re...

متن کامل

Designing Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network

In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...

متن کامل

A two phases approach for discriminating efficient candidate by using DEA inspired procedure

There are several methods to ranking DMUs in Data Envelopment Analysis (DEA) and candidates in voting system. This paper proposes a new two phases method based on DEA’s concepts. The first phase presents an aspiration rank for each candidate and second phase propose final ranking.

متن کامل

Ontology for Robot Programming domain

Robot programming requires knowledge of embedded systems, mechatronics, principles of kinematics and locomotion, sensors and actuators, control algorithms, behaviour planning and communication protocols. A complexity of robotics domain underscores the need for developing a domain ontology that describes domain concepts, their properties, restrictions and relationships between concepts. The pape...

متن کامل

Validation of Voting Committees

This article contains a method to bound the test errors of voting committees with members chosen from a pool of trained classifiers. There are so many prospective committees that validating them directly does not achieve useful error bounds. Because there are fewer classifiers than prospective committees, it is better to validate the classifiers individually than use linear programming to infer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Robotics Res.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1999